Normal numbers and finite automata
نویسندگان
چکیده
منابع مشابه
Normal numbers and finite automata
We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are finite automata augmented with an output transition function such that the automata input-output behaviour is injective; they are also known as injective finite-state transdu...
متن کاملGeneralized Finite Automata over Real and Complex Numbers
In a recent work, Gandhi, Khoussainov, and Liu [7] introduced and studied a generalized model of finite automata able to work over arbitrary structures. As one relevant area of research for this model the authors identify studying such automata over partciular structures such as real and algebraically closed fields. In this paper we start investigations into this direction. We prove several str...
متن کاملCongruences for Some Combinatorial Numbers via Finite Automata
Finite automata can be useful for proving the congruences for combinatorial numbers. We offer several examples as applications: First we consider the congruence of central Delannoy numbers module 3, then we find the congruences of the number of graphs and the number of total edges for noncrossing connected graphs module 3. One of these results answers a conjecture of Deutsch and Sagan in affirm...
متن کاملDiophantine properties of real numbers generated by finite automata
We study some Diophantine properties of automatic real numbers and we present a method to derive irrationality measures for such numbers. As a consequence, we prove that the b-adic expansion of a Liouville number cannot be generated by a finite automaton, a conjecture due to Shallit.
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.01.019